A Gallai-Edmonds-type structure theorem for path-matchings
نویسندگان
چکیده
As a generalization of matchings, Cunningham and Geelen introduced the notion of path-matchings. We give a structure theorem for path-matchings which generalizes the fundamental Gallai-Edmonds structure theorem for matchings. Our proof is purely combinatorial.
منابع مشابه
On the maximum even factor in weakly symmetric graphs
As a common generalization of matchings and matroid intersection, W.H. Cunningham and J.F. Geelen introduced the notion of path-matchings, then they introduced the more general notion of even factor in weakly symmetric digraphs. Here we give a min-max formula for the maximum cardinality of an even factor. Our proof is purely combinatorial. We also provide a Gallai-Edmonds-type structure theorem...
متن کاملAn Alternative Proof of Lovász’s Cathedral Theorem
A graph G with a perfect matching is called saturated if G + e has more perfect matchings than G for any edge e that is not in G. Lovász gave a characterization of the saturated graphs called the cathedral theorem, with some applications to the enumeration problem of perfect matchings, and later Szigeti gave another proof. In this paper, we give a new proof with our preceding works which reveal...
متن کاملThe Path-Packing Structure of Graphs
We prove Edmonds-Gallai type structure theorems for Mader’s edgeand vertex-disjoint paths including also capacitated variants, and state a conjecture generalizing Mader’s minimax theorems on path packings and Cunningham and Geelen’s path-matching theorem.
متن کاملThe Third Proof of Lovász's Cathedral Theorem
This paper is on matching theory. A graph with perfect matching is called saturated if any addition of one complement edge creates a new perfect matching. Lovász gave a characterization of the saturated graphs called the cathedral theorem, and later Szigeti gave another proof. In this paper, we gave a new proof with our preceding works, which revealed the canonical structure of general graph wi...
متن کاملOre, Berge–Tutte, and Gallai–Edmonds
We present a short proof of the Berge–Tutte Formula and the Gallai–Edmonds Structure Theorem based on Ore’s Defect Formula and Anderson’s proof of Tutte’s 1-Factor Theorem from Hall’s Theorem. The fundamental theorems on matchings in graphs have been proved in many ways, and generally they all imply each other. The most well-known is Hall’s Theorem [7] characterizing when a bipartite graph has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 46 شماره
صفحات -
تاریخ انتشار 2004